Theorem elwina 10639

Description: Conditions of weak inaccessibility. (Contributed by Mario Carneiro, 22-Jun-2013.)

Assertion

Ref	Expression
elwina	⊢ (𝐴 ∈ Inaccw ↔ (𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≺ 𝑦))

Distinct variable group:   𝑥,𝐴,𝑦

Proof of Theorem elwina

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3468	. 2 ⊢ (𝐴 ∈ Inaccw → 𝐴 ∈ V)
2		fvex 6871	. . . 4 ⊢ (cf‘𝐴) ∈ V
3		eleq1 2816	. . . 4 ⊢ ((cf‘𝐴) = 𝐴 → ((cf‘𝐴) ∈ V ↔ 𝐴 ∈ V))
4	2, 3	mpbii 233	. . 3 ⊢ ((cf‘𝐴) = 𝐴 → 𝐴 ∈ V)
5	4	3ad2ant2 1134	. 2 ⊢ ((𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≺ 𝑦) → 𝐴 ∈ V)
6		neeq1 2987	. . . 4 ⊢ (𝑧 = 𝐴 → (𝑧 ≠ ∅ ↔ 𝐴 ≠ ∅))
7		fveq2 6858	. . . . 5 ⊢ (𝑧 = 𝐴 → (cf‘𝑧) = (cf‘𝐴))
8		eqeq12 2746	. . . . 5 ⊢ (((cf‘𝑧) = (cf‘𝐴) ∧ 𝑧 = 𝐴) → ((cf‘𝑧) = 𝑧 ↔ (cf‘𝐴) = 𝐴))
9	7, 8	mpancom 688	. . . 4 ⊢ (𝑧 = 𝐴 → ((cf‘𝑧) = 𝑧 ↔ (cf‘𝐴) = 𝐴))
10		rexeq 3295	. . . . 5 ⊢ (𝑧 = 𝐴 → (∃𝑦 ∈ 𝑧 𝑥 ≺ 𝑦 ↔ ∃𝑦 ∈ 𝐴 𝑥 ≺ 𝑦))
11	10	raleqbi1dv 3311	. . . 4 ⊢ (𝑧 = 𝐴 → (∀𝑥 ∈ 𝑧 ∃𝑦 ∈ 𝑧 𝑥 ≺ 𝑦 ↔ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≺ 𝑦))
12	6, 9, 11	3anbi123d 1438	. . 3 ⊢ (𝑧 = 𝐴 → ((𝑧 ≠ ∅ ∧ (cf‘𝑧) = 𝑧 ∧ ∀𝑥 ∈ 𝑧 ∃𝑦 ∈ 𝑧 𝑥 ≺ 𝑦) ↔ (𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≺ 𝑦)))
13		df-wina 10637	. . 3 ⊢ Inaccw = {𝑧 ∣ (𝑧 ≠ ∅ ∧ (cf‘𝑧) = 𝑧 ∧ ∀𝑥 ∈ 𝑧 ∃𝑦 ∈ 𝑧 𝑥 ≺ 𝑦)}
14	12, 13	elab2g 3647	. 2 ⊢ (𝐴 ∈ V → (𝐴 ∈ Inaccw ↔ (𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≺ 𝑦)))
15	1, 5, 14	pm5.21nii 378	1 ⊢ (𝐴 ∈ Inaccw ↔ (𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≺ 𝑦))

Syntax hints:   ↔ wb 206   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109   ≠ wne 2925  ∀wral 3044  ∃wrex 3053  Vcvv 3447  ∅c0 4296   class class class wbr 5107  ‘cfv 6511   ≺ csdm 8917  cfccf 9890  Inacc_wcwina 10635

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701  ax-nul 5261

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-iota 6464  df-fv 6519  df-wina 10637

This theorem is referenced by:  winaon  10641  inawina  10643  winacard  10645  winainf  10647  winalim2  10649  winafp  10650  gchina  10652