Theorem zorng 10510

Description: Zorn's Lemma. If the union of every chain (with respect to inclusion) in a set belongs to the set, then the set contains a maximal element. Theorem 6M of [Enderton] p. 151. This version of zorn 10513 avoids the Axiom of Choice by assuming that 𝐴 is well-orderable. (Contributed by NM, 12-Aug-2004.) (Revised by Mario Carneiro, 9-May-2015.)

Assertion

Ref	Expression
zorng	⊢ ((𝐴 ∈ dom card ∧ ∀𝑧((𝑧 ⊆ 𝐴 ∧ [⊊] Or 𝑧) → ∪ 𝑧 ∈ 𝐴)) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦)

Distinct variable group:   𝑥,𝑦,𝑧,𝐴

Proof of Theorem zorng

Dummy variable 𝑢 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		risset 3239	. . . . . 6 ⊢ (∪ 𝑧 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 𝑥 = ∪ 𝑧)
2		eqimss2 3993	. . . . . . . . 9 ⊢ (𝑥 = ∪ 𝑧 → ∪ 𝑧 ⊆ 𝑥)
3		unissb 4904	. . . . . . . . 9 ⊢ (∪ 𝑧 ⊆ 𝑥 ↔ ∀𝑢 ∈ 𝑧 𝑢 ⊆ 𝑥)
4	2, 3	sylib 221	. . . . . . . 8 ⊢ (𝑥 = ∪ 𝑧 → ∀𝑢 ∈ 𝑧 𝑢 ⊆ 𝑥)
5		vex 3457	. . . . . . . . . . . 12 ⊢ 𝑥 ∈ V
6	5	brrpss 7731	. . . . . . . . . . 11 ⊢ (𝑢 [⊊] 𝑥 ↔ 𝑢 ⊊ 𝑥)
7	6	orbi1i 927	. . . . . . . . . 10 ⊢ ((𝑢 [⊊] 𝑥 ∨ 𝑢 = 𝑥) ↔ (𝑢 ⊊ 𝑥 ∨ 𝑢 = 𝑥))
8		sspss 4053	. . . . . . . . . 10 ⊢ (𝑢 ⊆ 𝑥 ↔ (𝑢 ⊊ 𝑥 ∨ 𝑢 = 𝑥))
9	7, 8	bitr4i 281	. . . . . . . . 9 ⊢ ((𝑢 [⊊] 𝑥 ∨ 𝑢 = 𝑥) ↔ 𝑢 ⊆ 𝑥)
10	9	ralbii 3110	. . . . . . . 8 ⊢ (∀𝑢 ∈ 𝑧 (𝑢 [⊊] 𝑥 ∨ 𝑢 = 𝑥) ↔ ∀𝑢 ∈ 𝑧 𝑢 ⊆ 𝑥)
11	4, 10	sylibr 237	. . . . . . 7 ⊢ (𝑥 = ∪ 𝑧 → ∀𝑢 ∈ 𝑧 (𝑢 [⊊] 𝑥 ∨ 𝑢 = 𝑥))
12	11	reximi 3102	. . . . . 6 ⊢ (∃𝑥 ∈ 𝐴 𝑥 = ∪ 𝑧 → ∃𝑥 ∈ 𝐴 ∀𝑢 ∈ 𝑧 (𝑢 [⊊] 𝑥 ∨ 𝑢 = 𝑥))
13	1, 12	sylbi 220	. . . . 5 ⊢ (∪ 𝑧 ∈ 𝐴 → ∃𝑥 ∈ 𝐴 ∀𝑢 ∈ 𝑧 (𝑢 [⊊] 𝑥 ∨ 𝑢 = 𝑥))
14	13	imim2i 17	. . . 4 ⊢ (((𝑧 ⊆ 𝐴 ∧ [⊊] Or 𝑧) → ∪ 𝑧 ∈ 𝐴) → ((𝑧 ⊆ 𝐴 ∧ [⊊] Or 𝑧) → ∃𝑥 ∈ 𝐴 ∀𝑢 ∈ 𝑧 (𝑢 [⊊] 𝑥 ∨ 𝑢 = 𝑥)))
15	14	alimi 1844	. . 3 ⊢ (∀𝑧((𝑧 ⊆ 𝐴 ∧ [⊊] Or 𝑧) → ∪ 𝑧 ∈ 𝐴) → ∀𝑧((𝑧 ⊆ 𝐴 ∧ [⊊] Or 𝑧) → ∃𝑥 ∈ 𝐴 ∀𝑢 ∈ 𝑧 (𝑢 [⊊] 𝑥 ∨ 𝑢 = 𝑥)))
16		porpss 7732	. . . 4 ⊢ [⊊] Po 𝐴
17		zorn2g 10509	. . . 4 ⊢ ((𝐴 ∈ dom card ∧ [⊊] Po 𝐴 ∧ ∀𝑧((𝑧 ⊆ 𝐴 ∧ [⊊] Or 𝑧) → ∃𝑥 ∈ 𝐴 ∀𝑢 ∈ 𝑧 (𝑢 [⊊] 𝑥 ∨ 𝑢 = 𝑥))) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 [⊊] 𝑦)
18	16, 17	mp3an2 1478	. . 3 ⊢ ((𝐴 ∈ dom card ∧ ∀𝑧((𝑧 ⊆ 𝐴 ∧ [⊊] Or 𝑧) → ∃𝑥 ∈ 𝐴 ∀𝑢 ∈ 𝑧 (𝑢 [⊊] 𝑥 ∨ 𝑢 = 𝑥))) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 [⊊] 𝑦)
19	15, 18	sylan2 605	. 2 ⊢ ((𝐴 ∈ dom card ∧ ∀𝑧((𝑧 ⊆ 𝐴 ∧ [⊊] Or 𝑧) → ∪ 𝑧 ∈ 𝐴)) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 [⊊] 𝑦)
20		vex 3457	. . . . . 6 ⊢ 𝑦 ∈ V
21	20	brrpss 7731	. . . . 5 ⊢ (𝑥 [⊊] 𝑦 ↔ 𝑥 ⊊ 𝑦)
22	21	notbii 323	. . . 4 ⊢ (¬ 𝑥 [⊊] 𝑦 ↔ ¬ 𝑥 ⊊ 𝑦)
23	22	ralbii 3110	. . 3 ⊢ (∀𝑦 ∈ 𝐴 ¬ 𝑥 [⊊] 𝑦 ↔ ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦)
24	23	rexbii 3111	. 2 ⊢ (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 [⊊] 𝑦 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦)
25	19, 24	sylib 221	1 ⊢ ((𝐴 ∈ dom card ∧ ∀𝑧((𝑧 ⊆ 𝐴 ∧ [⊊] Or 𝑧) → ∪ 𝑧 ∈ 𝐴)) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∨ wo 861  ∀wal 1568   = wceq 1570   ∈ wcel 2145  ∀wral 3078  ∃wrex 3088   ⊆ wss 3902   ⊊ wpss 3903  ∪ cuni 4870   class class class wbr 5107   Po wpo 5565   Or wor 5566  dom cdm 5659   [⊊] crpss 7727  cardccrd 9944

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-se 5613  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-isom 6546  df-riota 7374  df-ov 7420  df-rpss 7728  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-en 8957  df-card 9948

This theorem is used by:  zornn0g  10511  zorn  10513