Theorem isarchi 33047

Description: Express the predicate "𝑊 is Archimedean ". (Contributed by Thierry Arnoux, 30-Jan-2018.)

Hypotheses

Ref	Expression
isarchi.b	⊢ 𝐵 = (Base‘𝑊)
isarchi.0	⊢ 0 = (0g‘𝑊)
isarchi.i	⊢ < = (⋘‘𝑊)

Assertion

Ref	Expression
isarchi	⊢ (𝑊 ∈ 𝑉 → (𝑊 ∈ Archi ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑥 < 𝑦))

Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝑊,𝑦

Allowed substitution hints:   < (𝑥,𝑦)   𝑉(𝑥,𝑦)   0 (𝑥,𝑦)

Proof of Theorem isarchi

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveqeq2 6910	. . 3 ⊢ (𝑤 = 𝑊 → ((⋘‘𝑤) = ∅ ↔ (⋘‘𝑊) = ∅))
2		df-archi 33044	. . 3 ⊢ Archi = {𝑤 ∣ (⋘‘𝑤) = ∅}
3	1, 2	elab2g 3668	. 2 ⊢ (𝑊 ∈ 𝑉 → (𝑊 ∈ Archi ↔ (⋘‘𝑊) = ∅))
4		isarchi.b	. . . 4 ⊢ 𝐵 = (Base‘𝑊)
5	4	inftmrel 33045	. . 3 ⊢ (𝑊 ∈ 𝑉 → (⋘‘𝑊) ⊆ (𝐵 × 𝐵))
6		ss0b 4402	. . . . 5 ⊢ ((⋘‘𝑊) ⊆ ∅ ↔ (⋘‘𝑊) = ∅)
7		ssrel2 5791	. . . . 5 ⊢ ((⋘‘𝑊) ⊆ (𝐵 × 𝐵) → ((⋘‘𝑊) ⊆ ∅ ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) → ⟨𝑥, 𝑦⟩ ∈ ∅)))
8	6, 7	bitr3id 284	. . . 4 ⊢ ((⋘‘𝑊) ⊆ (𝐵 × 𝐵) → ((⋘‘𝑊) = ∅ ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) → ⟨𝑥, 𝑦⟩ ∈ ∅)))
9		noel 4333	. . . . . . . 8 ⊢ ¬ ⟨𝑥, 𝑦⟩ ∈ ∅
10	9	nbn 371	. . . . . . 7 ⊢ (¬ ⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) ↔ (⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) ↔ ⟨𝑥, 𝑦⟩ ∈ ∅))
11		isarchi.i	. . . . . . . . 9 ⊢ < = (⋘‘𝑊)
12	11	breqi 5159	. . . . . . . 8 ⊢ (𝑥 < 𝑦 ↔ 𝑥(⋘‘𝑊)𝑦)
13		df-br 5154	. . . . . . . 8 ⊢ (𝑥(⋘‘𝑊)𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊))
14	12, 13	bitri 274	. . . . . . 7 ⊢ (𝑥 < 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊))
15	10, 14	xchnxbir 332	. . . . . 6 ⊢ (¬ 𝑥 < 𝑦 ↔ (⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) ↔ ⟨𝑥, 𝑦⟩ ∈ ∅))
16	9	pm2.21i 119	. . . . . . 7 ⊢ (⟨𝑥, 𝑦⟩ ∈ ∅ → ⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊))
17		dfbi2 473	. . . . . . 7 ⊢ ((⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) ↔ ⟨𝑥, 𝑦⟩ ∈ ∅) ↔ ((⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) → ⟨𝑥, 𝑦⟩ ∈ ∅) ∧ (⟨𝑥, 𝑦⟩ ∈ ∅ → ⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊))))
18	16, 17	mpbiran2 708	. . . . . 6 ⊢ ((⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) ↔ ⟨𝑥, 𝑦⟩ ∈ ∅) ↔ (⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) → ⟨𝑥, 𝑦⟩ ∈ ∅))
19	15, 18	bitri 274	. . . . 5 ⊢ (¬ 𝑥 < 𝑦 ↔ (⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) → ⟨𝑥, 𝑦⟩ ∈ ∅))
20	19	2ralbii 3118	. . . 4 ⊢ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑥 < 𝑦 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) → ⟨𝑥, 𝑦⟩ ∈ ∅))
21	8, 20	bitr4di 288	. . 3 ⊢ ((⋘‘𝑊) ⊆ (𝐵 × 𝐵) → ((⋘‘𝑊) = ∅ ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑥 < 𝑦))
22	5, 21	syl 17	. 2 ⊢ (𝑊 ∈ 𝑉 → ((⋘‘𝑊) = ∅ ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑥 < 𝑦))
23	3, 22	bitrd 278	1 ⊢ (𝑊 ∈ 𝑉 → (𝑊 ∈ Archi ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑥 < 𝑦))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   = wceq 1534   ∈ wcel 2099  ∀wral 3051   ⊆ wss 3947  ∅c0 4325  ⟨cop 4639   class class class wbr 5153   × cxp 5680  ‘cfv 6554  Basecbs 17213  0_gc0g 17454  ⋘cinftm 33041  Archicarchi 33042

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2697  ax-sep 5304  ax-nul 5311  ax-pow 5369  ax-pr 5433  ax-un 7746

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2529  df-eu 2558  df-clab 2704  df-cleq 2718  df-clel 2803  df-nfc 2878  df-ne 2931  df-ral 3052  df-rex 3061  df-rab 3420  df-v 3464  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4326  df-if 4534  df-pw 4609  df-sn 4634  df-pr 4636  df-op 4640  df-uni 4914  df-br 5154  df-opab 5216  df-mpt 5237  df-id 5580  df-xp 5688  df-rel 5689  df-cnv 5690  df-co 5691  df-dm 5692  df-iota 6506  df-fun 6556  df-fv 6562  df-ov 7427  df-inftm 33043  df-archi 33044

This theorem is referenced by:  xrnarchi  33049  isarchi2  33050

Otomatik - 173.255.232.114 CloudFlare DNS Türk Telekom DNS Google DNS Open DNS

OSZAR »