Theorem elwina 10609

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 3463	. 2 ⊢ (𝐴 ∈ Inaccw → 𝐴 ∈ V)
2		fvex 6855	. . . 4 ⊢ (cf‘𝐴) ∈ V
3		eleq1 2825	. . . 4 ⊢ ((cf‘𝐴) = 𝐴 → ((cf‘𝐴) ∈ V ↔ 𝐴 ∈ V))
4	2, 3	mpbii 233	. . 3 ⊢ ((cf‘𝐴) = 𝐴 → 𝐴 ∈ V)
5	4	3ad2ant2 1135	. 2 ⊢ ((𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≺ 𝑦) → 𝐴 ∈ V)
6		neeq1 2995	. . . 4 ⊢ (𝑧 = 𝐴 → (𝑧 ≠ ∅ ↔ 𝐴 ≠ ∅))
7		fveq2 6842	. . . . 5 ⊢ (𝑧 = 𝐴 → (cf‘𝑧) = (cf‘𝐴))
8		eqeq12 2754	. . . . 5 ⊢ (((cf‘𝑧) = (cf‘𝐴) ∧ 𝑧 = 𝐴) → ((cf‘𝑧) = 𝑧 ↔ (cf‘𝐴) = 𝐴))
9	7, 8	mpancom 689	. . . 4 ⊢ (𝑧 = 𝐴 → ((cf‘𝑧) = 𝑧 ↔ (cf‘𝐴) = 𝐴))
10		rexeq 3294	. . . . 5 ⊢ (𝑧 = 𝐴 → (∃𝑦 ∈ 𝑧 𝑥 ≺ 𝑦 ↔ ∃𝑦 ∈ 𝐴 𝑥 ≺ 𝑦))
11	10	raleqbi1dv 3310	. . . 4 ⊢ (𝑧 = 𝐴 → (∀𝑥 ∈ 𝑧 ∃𝑦 ∈ 𝑧 𝑥 ≺ 𝑦 ↔ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≺ 𝑦))
12	6, 9, 11	3anbi123d 1439	. . 3 ⊢ (𝑧 = 𝐴 → ((𝑧 ≠ ∅ ∧ (cf‘𝑧) = 𝑧 ∧ ∀𝑥 ∈ 𝑧 ∃𝑦 ∈ 𝑧 𝑥 ≺ 𝑦) ↔ (𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≺ 𝑦)))
13		df-wina 10607	. . 3 ⊢ Inaccw = {𝑧 ∣ (𝑧 ≠ ∅ ∧ (cf‘𝑧) = 𝑧 ∧ ∀𝑥 ∈ 𝑧 ∃𝑦 ∈ 𝑧 𝑥 ≺ 𝑦)}
14	12, 13	elab2g 3637	. 2 ⊢ (𝐴 ∈ V → (𝐴 ∈ Inaccw ↔ (𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≺ 𝑦)))
15	1, 5, 14	pm5.21nii 378	1 ⊢ (𝐴 ∈ Inaccw ↔ (𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≺ 𝑦))

Syntax hints:   ↔ wb 206   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052  ∃wrex 3062  Vcvv 3442  ∅c0 4287   class class class wbr 5100  ‘cfv 6500   ≺ csdm 8894  cfccf 9861  Inacc_wcwina 10605

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-nul 5253

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-iota 6456  df-fv 6508  df-wina 10607

This theorem is referenced by:  winaon  10611  inawina  10613  winacard  10615  winainf  10617  winalim2  10619  winafp  10620  gchina  10622