Theorem isarchi 33842

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 6925	. . 3 ⊢ (𝑤 = 𝑊 → ((⋘‘𝑤) = ∅ ↔ (⋘‘𝑊) = ∅))
2		df-archi 33839	. . 3 ⊢ Archi = {𝑤 ∣ (⋘‘𝑤) = ∅}
3	1, 2	elab2g 3637	. 2 ⊢ (𝑊 ∈ 𝑉 → (𝑊 ∈ Archi ↔ (⋘‘𝑊) = ∅))
4		isarchi.b	. . . 4 ⊢ 𝐵 = (Base‘𝑊)
5	4	inftmrel 33840	. . 3 ⊢ (𝑊 ∈ 𝑉 → (⋘‘𝑊) ⊆ (𝐵 × 𝐵))
6		ss0b 4354	. . . . 5 ⊢ ((⋘‘𝑊) ⊆ ∅ ↔ (⋘‘𝑊) = ∅)
7		ssrel2 5770	. . . . 5 ⊢ ((⋘‘𝑊) ⊆ (𝐵 × 𝐵) → ((⋘‘𝑊) ⊆ ∅ ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) → ⟨𝑥, 𝑦⟩ ∈ ∅)))
8	6, 7	bitr3id 288	. . . 4 ⊢ ((⋘‘𝑊) ⊆ (𝐵 × 𝐵) → ((⋘‘𝑊) = ∅ ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) → ⟨𝑥, 𝑦⟩ ∈ ∅)))
9		noel 4286	. . . . . . . 8 ⊢ ¬ ⟨𝑥, 𝑦⟩ ∈ ∅
10	9	nbn 375	. . . . . . 7 ⊢ (¬ ⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) ↔ (⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) ↔ ⟨𝑥, 𝑦⟩ ∈ ∅))
11		isarchi.i	. . . . . . . . 9 ⊢ < = (⋘‘𝑊)
12	11	breqi 5114	. . . . . . . 8 ⊢ (𝑥 < 𝑦 ↔ 𝑥(⋘‘𝑊)𝑦)
13		df-br 5109	. . . . . . . 8 ⊢ (𝑥(⋘‘𝑊)𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊))
14	12, 13	bitri 278	. . . . . . 7 ⊢ (𝑥 < 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊))
15	10, 14	xchnxbir 336	. . . . . 6 ⊢ (¬ 𝑥 < 𝑦 ↔ (⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) ↔ ⟨𝑥, 𝑦⟩ ∈ ∅))
16	9	pm2.21i 120	. . . . . . 7 ⊢ (⟨𝑥, 𝑦⟩ ∈ ∅ → ⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊))
17		dfbi2 480	. . . . . . 7 ⊢ ((⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) ↔ ⟨𝑥, 𝑦⟩ ∈ ∅) ↔ ((⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) → ⟨𝑥, 𝑦⟩ ∈ ∅) ∧ (⟨𝑥, 𝑦⟩ ∈ ∅ → ⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊))))
18	16, 17	mpbiran2 723	. . . . . 6 ⊢ ((⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) ↔ ⟨𝑥, 𝑦⟩ ∈ ∅) ↔ (⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) → ⟨𝑥, 𝑦⟩ ∈ ∅))
19	15, 18	bitri 278	. . . . 5 ⊢ (¬ 𝑥 < 𝑦 ↔ (⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) → ⟨𝑥, 𝑦⟩ ∈ ∅))
20	19	2ralbii 3141	. . . 4 ⊢ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑥 < 𝑦 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) → ⟨𝑥, 𝑦⟩ ∈ ∅))
21	8, 20	bitr4di 292	. . 3 ⊢ ((⋘‘𝑊) ⊆ (𝐵 × 𝐵) → ((⋘‘𝑊) = ∅ ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑥 < 𝑦))
22	5, 21	syl 18	. 2 ⊢ (𝑊 ∈ 𝑉 → ((⋘‘𝑊) = ∅ ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑥 < 𝑦))
23	3, 22	bitrd 282	1 ⊢ (𝑊 ∈ 𝑉 → (𝑊 ∈ Archi ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑥 < 𝑦))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2147  ∀wral 3080   ⊆ wss 3900  ∅c0 4281  ⟨cop 4840   class class class wbr 5108   × cxp 5656  ‘cfv 6566  Basecbs 17431  0_gc0g 17660  ⋘cinftm 33836  Archicarchi 33837

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-inftm 33838  df-archi 33839

This theorem is used by:  xrnarchi  33844  isarchi2  33845